Assertions in AFA Set Theory

نویسنده

  • Anton Benz
چکیده

In this paper we consider an application of the theory of non–wellfounded sets to the modelling of epistemic updates triggered by assertions in dialogue. We concentrate mainly on what we might call defective dialogue, i.e. dialogue in epistemic contexts where the speaker has either erroneous beliefs or is not sincere in his language use. We develop our theory within a special possible worlds framework which uses AFA set theory for representing information states of dialogue participants. We first characterise the use of assertions in ideal dialogue situations and then show how pragmatic principles connected to perspectives and speaker’s intentions define extended uses in defective situations. On the formal level, the pragmatic considerations lead to the introduction of operators which can be used systematically to extend the domain of assertions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

lamda-Z: Zermelo's Set Theory as a PTS with 4 Sorts

We introduce a pure type system (PTS) λZ with four sorts and show that this PTS captures the proof-theoretic strength of Zermelo’s set theory. For that, we show that the embedding of the language of set theory into λZ via the ‘sets as pointed graphs’ translation makes λZ a conservative extension of IZ + AFA + TC (intuitionistic Zermelo’s set theory plus Aczel’s antifoundation axiom plus the axi...

متن کامل

Lambda-Z: Zermelo’s Set Theory as a PTS with 4 Sorts

We introduce a pure type system (PTS) λZ with four sorts and show that this PTS captures the proof-theoretic strength of Zermelo’s set theory. For that, we show that the embedding of the language of set theory into λZ via the ‘sets as pointed graphs’ translation makes λZ a conservative extension of IZ + AFA + TC (intuitionistic Zermelo’s set theory plus Aczel’s antifoundation axiom plus the axi...

متن کامل

λZ: Zermelo’s Set Theory as a PTS with 4 Sorts

We introduce a pure type system (PTS) λZ with four sorts and show that this PTS captures the proof-theoretic strength of Zermelo’s set theory. For that, we show that the embedding of the language of set theory into λZ via the ‘sets as pointed graphs’ translation makes λZ a conservative extension of IZ + AFA + TC (intuitionistic Zermelo’s set theory plus Aczel’s antifoundation axiom plus the axi...

متن کامل

Forcing under Anti-Foundation Axiom: An expression of the stalks

We introduce a new simple way of defining the forcing method that works well in the usual setting under FA, the Foundation Axiom, and moreover works even under Aczel’s AFA, the Anti-Foundation Axiom. This new way allows us to have an intuition about what happens in defining the forcing relation. The main tool is H. Friedman’s method of defining the extensional membership relation ∈ by means of ...

متن کامل

Kripke-Platek Set Theory and the Anti-Foundation Axiom

The paper investigates the strength of the Anti-Foundation Axiom, AFA, on the basis of Kripke-Platek set theory without Foundation. It is shown that the addition of AFA considerably increases the proof theoretic strength. 1. Introduction Intrinsically circular phenomena have come to the attention of researchers in diiering elds such as mathematical logic, computer science, artiicial intelligenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007